Iterative parameter estimate with batched binary-valued observations
نویسندگان
چکیده
منابع مشابه
Identification of Wiener systems with binary-valued output observations
This work is concerned with identification of Wiener systems whose outputs are measured by binary-valued sensors. The system consists of a linear FIR (Finite Impulse Response) subsystem of known order, followed by a nonlinear function with a known parametrization structure. The parameters of both linear and nonlinear parts are unknown. Input design, identification algorithms, and their essentia...
متن کاملSignal estimation with binary-valued sensors
This paper introduces several algorithms for signal estimation using binary-valued output sensing. The main idea is derived from the empirical measure approach for quantized identification, which has been shown to be convergent and asymptotically efficient when the unknown parameters are constants. Signal estimation under binary-valued observations must take into consideration of time varying v...
متن کاملMulti-valued Simulation with Binary Decision Diagrams
The paper presents a new method for multivalued simulation of digital circuits based on calculation of Boolean derivatives on BDDs (or structural alternative graphs). A procedure for calculation of maximums of Boolean derivatives as the basis of multivalued simulation is given. The method is applicable for component level representations of digital circuits where as components arbitrary subcirc...
متن کاملLearningfor Binary Valued
We propose a new approach for using online competitive learning on binary data. The usual Euclidean distance is replaced by binary distance measures, which take possible asymmetries of binary data into account and therefore provide a \diierent point of view" for looking at the data. The method is demonstrated on two artiicial examples and applied on tourist marketing research data.
متن کاملIterative Projection Algorithms with a Binary Constraint
Iterative projection algorithms can be an effective method for solving image reconstruction problems with limited data by incorporating a priori information (constraints) on the image. However, these algorithms may experience convergence difficulties if the constraints are non-convex. Iterative projection algorithms are evaluated for the molecular envelope problem in x-ray crystallography where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2016
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-015-5304-z